Nonbinary Quasi-Cyclic LDPC Cycle Codes with Low-Density Systematic Quasi-Cyclic Generator Matrices

نویسندگان

  • Yang Yang
  • Chao Chen
  • Jianjun Mu
  • Jing Wang
  • Rong Sun
  • Xinmei Wang
چکیده

In this letter, we propose an appealing class of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) cycle codes. The parity-check matrix is carefully designed such that the corresponding generator matrix has some nice properties: 1) systematic, 2) quasi-cyclic, and 3) sparse, which allows a parallel encoding with low complexity. Simulation results show that the performance of the proposed encoding-aware LDPC codes is comparable to that of the progressive-edge-growth (PEG) constructed nonbinary LDPC cycle codes. key words: low-density parity-check (LDPC) code, nonbinary, quasi-cyclic (QC), low-density generator matrix, cycle code

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A method for constructing parity-check matrices of non-binary quasi-cyclic LDPC codes

An algorithm for constructing parity-check matrices of nonbinary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base matrix and tries to eliminate them by selecting the circulants and the elements of GF(q). Firstly the algorithm tries to eliminate the cycles with the smallest number edges going outside the cycle. The efficiency of t...

متن کامل

Cyclic and Quasi-Cyclic LDPC Codes on Row and Column Constrained Parity-Check Matrices and Their Trapping Sets

This paper is concerned with construction and structural analysis of both cyclic and quasi-cyclic codes, particularly LDPC codes. It consists of three parts. The first part shows that a cyclic code given by a parity-check matrix in circulant form can be decomposed into descendant cyclic and quasi-cyclic codes of various lengths and rates. Some fundamental structural properties of these descenda...

متن کامل

Design of nonbinary quasi-cyclic low-density parity-check codes by maximising the minimum distance

In this paper, we propose a construction method of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes. The shift offset values of the circulant permutation submatrices are selected not only by maximising the girth but also by maximising the minimum distance upper bound. The proposed method provides a more rational optimisation way than only maximising the girth. Copyright © 2012 Jo...

متن کامل

Quasi-cyclic LDPC codes from difference families

We consider in this paper regular and nearly regular quasi-cyclic low-density paritycheck (LDPC) codes, derived from families of difference sets. The codes have girth at least 6, and sparse parity-check matrices. They are designed to perform well when iteratively decoded with the sum-product decoding algorithm and to allow low complexity encoding.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 94-B  شماره 

صفحات  -

تاریخ انتشار 2011